Parsing Tree Adjoining Grammars With A Preprocessor
نویسندگان
چکیده
This paper presents a preprocessor based parsing system for Tree Adjoining Grammars. The preprocessor is used for two purposes: (1) to organize the data structures, (2) to reduce the runtime processing load so that the parser executes fast. A parallel parsing algorithm is presented that takes advantage of the preprocessor. The future goals of the proposed research are to achieve scalability and efficiency in processing the language. Key-Words: parsing, language, grammar, parsing, preprocessor
منابع مشابه
Parsing Tree Adjoining Grammars and Tree Insertion Grammars with Simultaneous Adjunctions
A large part of wide coverage Tree Adjoining Grammars (TAG) is formed by trees that satisfy the restrictions imposed by Tree Insertion Grammars (TIG). This characteristic can be used to reduce the practical complexity of TAG parsing, applying the standard adjunction operation only in those cases in which the simpler cubic-time TIG adjunction cannot be applied. In this paper, we describe a parsi...
متن کاملLambek Grammars, Tree Adjoining Grammars and Hyperedge Replacement Grammars
Two recent extension of the nonassociative Lambek calculus, the LambekGrishin calculus and the multimodal Lambek calculus, are shown to generate class of languages as tree adjoining grammars, using (tree generating) hyperedge replacement grammars as an intermediate step. As a consequence both extensions are mildly context-sensitive formalisms and benefit from polynomial parsing algorithms.
متن کاملFast LR parsing Using Rich (Tree Adjoining) Grammars
We describe an LR parser of parts-ofspeech (and punctuation labels) for Tree Adjoining Grammars (TAGs), that solves table conflicts in a greedy way, with limited amount of backtracking. We evaluate the parser using the Penn Treebank showing that the method yield very fast parsers with at least reasonable accuracy, confirming the intuition that LR parsing benefits from the use of rich grammars.
متن کاملWeighted parsing of trees
We show how parsing of trees can be formalized in terms of the intersection of two tree languages. The focus is on weighted regular tree grammars and weighted tree adjoining grammars. Potential applications are discussed, such as parameter estimation across formalisms.
متن کاملTuLiPA: A syntax-semantics parsing environment for mildly context-sensitive formalisms
In this paper we present a parsing architecture that allows processing of different mildly context-sensitive formalisms, in particular Tree-Adjoining Grammar (TAG), Multi-Component Tree-Adjoining Grammar with Tree Tuples (TT-MCTAG) and simple Range Concatenation Grammar (RCG). Furthermore, for tree-based grammars, the parser computes not only syntactic analyses but also the corresponding semant...
متن کامل